/****************
*PID:
*Auth:Jonariguez
*****************
*/
#define lson k*2,l,m
#define rson k*2+1,m+1,r
#define rep(i,s,e) for(i=(s);i<=(e);i++)
#define For(j,s,e) For(j=(s);j<(e);j++)
#define sc(x) scanf("%d",&x)
#define In(x) scanf("%I64d",&x)
#define SS(x,y) scanf("d",&x,&y)
#define pf(x) printf("%d",x)
#define pfn(x) printf("%d\n",(x))
#define Pf(x) printf("%I64d",(x))
#define Pfn(x) printf("%I64d\n",(x))
#define Pc printf(" ")
#define PY puts("YES")
#define PN puts("NO")
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define PI acos(-1.0)
#include <stdio.h>
#include <string.h>
#include <string>
#include <math.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef int Ll;
Ll quick_pow(Ll a,Ll b,Ll MOD){a%=MOD;Ll res=1;while(b){if(b&1)res=(res*a)%MOD;b/=2;a=(a*a)%MOD;}return res;}

const int maxn=100000+10;
const int MOD=1e9+7;

int vis[maxn],deg[maxn];
int ans[maxn],n;
vector<int> vec[maxn];

void Topsort(){
    priority_queue<int> que;
    for(int i=1;i<=n;i++){
        if(deg[i]==0){
            que.push(i);
            vis[i]=1;
        }
    }
    int now=n;
    while(!que.empty()){
        int u=que.top();que.pop();
        ans[u]=now--;
        for(int i=0;i<vec[u].size();i++){
            int v=vec[u][i];
            if(--deg[v]==0 && vis[v]==0){
                que.push(v);vis[v]=1;
            }
        }
    }
}

int main()
{
    int i,j,m;
    scanf("%d%d",&n,&m);
    memset(vis,0,sizeof(vis));
    memset(deg,0,sizeof(deg));
    for(i=1;i<=m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        vec[v].push_back(u);
        deg[u]++;
    }
    Topsort();
    for(int i=1;i<=n;i++)
        printf("%d ",ans[i]);
    puts("");
    return 0;
}

/*
5 3
4 2
2 3
5 1
*/
